Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines

In this paper we study energy efficient deadline scheduling on multiprocessors in which the processors consumes power at a rate of s when running at speed s, where α ≥ 2. The problem is to dispatch jobs to processors and determine the speed and jobs to run for each processor so as to complete all jobs by their deadlines using the minimum energy. The problem has been well studied for the single ...

متن کامل

Throughput Maximization for Speed-Scaling with Agreeable Deadlines

We study the following energy-efficient scheduling problem. We are given a set of n jobs which have to be scheduled by a single processor whose speed can be varied dynamically. Each job Jj is characterized by a processing requirement (work) pj , a release date rj and a deadline dj . We are also given a budget of energy E which must not be exceeded and our objective is to maximize the throughput...

متن کامل

Speed scaling with power down scheduling for agreeable deadlines

We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload wj and a release time rj . The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we woul...

متن کامل

An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines

The problem of scheduling n unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The algorithm runs in O((logn)2) time and uses O(n'ljlogn) processors.

متن کامل

Speed Scaling for Scheduling Problems with Immediate Start of Jobs

We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Optimization

سال: 2013

ISSN: 1382-6905,1573-2886

DOI: 10.1007/s10878-013-9618-8